A coalgebraic perspective on linear weighted automata
نویسندگان
چکیده
منابع مشابه
A coalgebraic perspective on linear weighted automata
Article history: Received 23 March 2011 Revised 19 September 2011 Available online 30 December 2011 Weighted automata are a generalisation of non-deterministic automata where each transition, in addition to an input letter, has also a quantity expressing the weight (e.g. cost or probability) of its execution. As for non-deterministic automata, their behaviours can be expressed in terms of eithe...
متن کاملCoalgebraic Semantics of Heavy-Weighted Automata
In this paper we study heavy-weighted automata, a generalization of weighted automata in which the weights of the transitions can be formal power series. As for ordinary weighted automata, the behaviour of heavy-weighted automata is expressed in terms of formal power series. We propose several equivalent definitions for their semantics, including a system of behavioural differential equations (...
متن کاملAutomata and fixed point logic: A coalgebraic perspective
This paper generalizes existing connections between automata and logic to a coalgebraic abstraction level. Let F : Set→ Set be a standard functor that preserves weak pullbacks. We introduce various notions of F-automata, devices that operate on pointed F-coalgebras. The criterion under which such an automaton accepts or rejects a pointed coalgebra is formulated in terms of an infinite two-playe...
متن کاملModel Checking Linear Coalgebraic Temporal Logics: An Automata-Theoretic Approach
We extend the theory of maximal traces of pointed nondeterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras. We then consider linear coalgebraic temporal logics interpreted over non-deterministic coalgebras, and show how to reduce the model checking problem for such logics to the problem of deciding the winner in a regula...
متن کاملA Coalgebraic Perspective on Logical Interpretations
In Computer Science stepwise refinement of algebraic specifications is a well-known formal methodology for rigorous program development. This paper illustrates how techniques from Algebraic Logic, in particular that of interpretation, understood as a multifunction that preserves and reflects logical consequence, capture a number of relevant transformations in the context of software design, reu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2012
ISSN: 0890-5401
DOI: 10.1016/j.ic.2011.12.002